모든 번역물

A rewrite system is a set of rules with the following format:
S  T
where S is some expression that is transformed into T when the rule is used.
In this assignment you will write a program that will check if a rewrite system terminates or if there is a chance that it includes infinite loops.

The set of rules will be held in an AVL tree. The left hand side expression in every rule will serve as the key in the search tree.